Combinatorial complexity in o-minimal geometry

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complexity in O - Minimal Geometry

In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of n definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the combinatorial parts of similar bounds known in the case of semi-algebraic and semi-Pfaffian sets, and as a result vastly increases the applicability of results on combinat...

متن کامل

An Introduction to O-minimal Geometry

Preface These notes have served as a basis for a course in Pisa in Spring 1999. A parallel course on the construction of o-minimal structures was given by A. Macintyre. The content of these notes owes a great deal to the excellent book by L. van den Dries [vD]. Some interesting topics contained in this book are not included here, such as the Vapnik-Chervonenkis property. Part of the material wh...

متن کامل

On the Computational Complexity of some problems from Combinatorial Geometry

We study several canonical decision problems that arise from the most famous theorems from combinatorial geometry. We show that these are W[1]-hard (and NP-hard) if the dimension is part of the input by fpt-reductions (which are actually ptime-reductions) from the d-Sum problem. Among others, we show that computing the minimum size of a Caratheodory set and a Helly set and certain decision vers...

متن کامل

The Geometry of Minimal Types in Theories Interpretable in O-minimal

Definition 1.3. Let C be a monster model of a theory interpretable in o-minimal structure. • A set φ(x) is finite by o-minimal if there is some definable equivalence relation E with finite classes and domain φ(C and a definable binary relation < such that (φ(C)/E,<) together with the C-induced structure is an ominimal ordered set. • A type p(x) is finite by o-minimal if there is some finite by ...

متن کامل

Combinatorial optimization in geometry

In this paper we extend and unify the results of [20] and [19]. As a consequence, the results of [20] are generalized from the framework of ideal polyhedra in H to that of singular Euclidean structures on surfaces, possibly with an infinite number of singularities (by contrast, the results of [20] can be viewed as applying to the case of non-singular structures on the disk, with a finite number...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the London Mathematical Society

سال: 2009

ISSN: 0024-6115

DOI: 10.1112/plms/pdp031